Gossiping in the presence of omission failures
نویسنده
چکیده
We consider the problem of exchanging information in a synchronous message-passing system, where processors are prone to omission failures: faulty processors may not send or receive messages properly. We develop the efficient algorithm that solves this problem in time O(logn) and sends O(n+t) messages.
منابع مشابه
Fault-tolerant distributed algorithms
The following thesis contains several results regarding communication complexity of two basic distributed problems: gossiping and consensus. Gossiping is a problem of exchanging initial knowledge between all processes. Consensus is a problem of making a common decision by all processes. The thesis consist of two parts. First part is devoted to the gossiping problem, analyzed in three different ...
متن کاملUniform Agreement Despite Process Omission Failures
A process fails by omission if it “forgets” to send or receive messages. Considering omission failures is crucial for distributed systems, as such failures model both crash failures and incorrect behavior of process input/output buffers (such as buffer overflow). So, designing protocols that cope not only with crash failures but also with omission failures is a real challenge as soon as one is ...
متن کاملRobust Control of a Quadrotor in the Presence of Actuators' Failure
Today, robots and unmanned aerial vehicles are being used extensively in modern societies. Due to a wide range of applications, it has attracted much attention among scientists over the past decades. This paper deals with the problem of the stability of a four-rotor flying robot called quadrotor, which is an under-actuated system, in the presence of operator or sensor failures. The dynamica...
متن کاملRobust gossiping with an application to consensus
We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processor...
متن کاملConsensus in the Presence of Timing Uncertainty :
We consider the time complexity of reaching agreement in a semi-synchronous model of distributed systems, in the presence of omission and Byzantine failures. In our semi-synchronous model, processes have inexact knowledge about the time to perform certain primitive actions: messages arrive within time d of when they are sent and the time between two consecutive steps of any process is in the kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005